Marxian Reproduction Prices Versus Prices of Production: Probability and Convergence

I shall argue two main points. The first is that although Marx is conventionally taken to have formulated two different theories of price in the the three volumes of Capital, labour values in volume I and prices of production in volume III, there is actually a third theory, hidden inside the reproduction schemes of volume II. This theory is not explicit, but can be logically deduced from the constraints that he presents on simple reproduction. It is not a theory of individual prices, but a theory of relative sectoral prices. I will go on to argue that this theory of sectoral prices allows us to make probabilistic arguments about the relative likely-hood that either production prices or labour values will operate at the level of reproduction schemes. This paper provides a measure on the configuration space associated with Marxian prices of production and labour values. By use of random matrix techniques it shows that the solutions space associated with prices of production is similar to that associated with classical labour values. In the latter part of the paper, a sample of reproduction schemes is simulated over time, under assumptions of capital movement, to see whether such systems dynamically converge on prices of production. It is found that some converge, and some fail to converge

3D Visualisation of Oil Reservoirs [POSTER]

No abstract available

Mises, Kantorovich and Economic Computation

An article that reviews the work of Kantorovich in the light of von Mises claim that rational calculations were impossible without markets. It gives a tutorial introduction to the use of Kantorovich's methods, compares his approach to that of Dantzig. An assesment is given of the extent to which new interior point methods of linear programming strengthen or weaken Kantorovich's claims.Kantorovich, Linear-programming, von-Mises

A compiler extension for parallelizing arrays automatically on the cell heterogeneous processor

This paper describes the approaches taken to extend an array programming language compiler using a Virtual SIMD Machine (VSM) model for parallelizing array operations on Cell Broadband Engine heterogeneous machine. This development is part of ongoing work at the University of Glasgow for developing array compilers that are beneficial for applications in many areas such as graphics, multimedia, image processing and scientific computation. Our extended compiler, which is built upon the VSM interface, eases the parallelization processes by allowing automatic parallelisation without the need for any annotations or process directives. The preliminary results demonstrate significant improvement especially on data-intensive applications

Against Hayek

Presents a critical analysis of Hayek in the light of modern computability and economic computability theory.Hayek, Computability, Socialism

A 3D Reconstruction Algorithm for the Location of Foundations in Demolished Buildings

The location of foundations in a demolished building can be accomplished by undertaking a Ground Penetrating Radar (GPR) survey and then to use the GPR data to generate 3D isosurfaces of what was beneath the soil surface using image reconstruction. The SIMCA ('SIMulated Correlation Algorithm') algorithm is a technique based on a comparison between the trace that would be returned by an ideal point reflector in the soil conditions at the site and the actual trace. During an initialization phase, SIMCA carries out radar simulation using the design parameters of the radar and the soil properties. The trace which would be returned by a target under these conditions is then used to form a kernel. Then SIMCA takes the raw data as the radar is scanned over the ground and removes clutter using a clutter removal technique. The system correlates the kernel with the data by carrying out volume correlation and produces 3D images of the surface of subterranean objects detected. The 3D isosurfaces are generated using MATLAB software. The validation of the algorithm has been accomplished by comparing the 3D isosurfaces produced by the SIMCA algorithm, Scheers algorithm and REFLEXW commercial software. Then the depth and the position in the x and y directions as obtained using MATLAB software for each of the cases are compared with the corresponding values approximately obtained from original Architect's drawings of the buildings

Sraffa's reproduction prices versus prices of production: probability and convergence

The article argues that the reproduction prices introduced in the first chapter of Sraffa's book are not necessarily compatible with the profit equalising prices that form the substance of the book. It uses probabilistic arguments about how probable it is that reproduction prices will approximate to profit equalising prices. By use of random matrix techniques, it shows that the solutions space associated with prices of production is similar to that associated with classical labour values. In the latter part of the article, a random sample of reproduction schemes is simulated over time, under assumptions of capital movement, to see whether such systems dynamically converge on profit equalising prices. It is found that some converge and some fail to converge

A Biologically Motivated Software Retina for Robotic Sensors for ARM-Based Mobile Platform Technology

A key issue in designing robotics systems is the cost of an integrated camera sensor that meets the bandwidth/processing requirement for many advanced robotics applications, especially lightweight robotics applications, such as visual surveillance or SLAM in autonomous aerial vehicles. There is currently much work going on to adapt smartphones to provide complete robot vision systems, as the smartphone is so exquisitely integrated by having camera(s), inertial sensing, sound I/O and excellent wireless connectivity. Mass market production makes this a very low-cost platform and manufacturers from quadrotor drone suppliers to children’s toys, such as the Meccanoid robot [5], employ a smartphone to provide a vision system/control system [7,8]. Accordingly, many research groups are attempting to optimise image analysis, computer vision and machine learning libraries for the smartphone platform. However current approaches to robot vision remain highly demanding for mobile processors such as the ARM, and while a number of algorithms have been developed, these are very stripped down, i.e. highly compromised in function or performance. For example, the semi-dense visual odometry implementation of [1] operates on images of only 320x240pixels. In our research we have been developing biologically motivated foveated vision algorithms based on a model of the mammalian retina [2], potentially 100 times more efficient than their conventional counterparts. Accordingly, vision systems based on the foveated architectures found in mammals have also the potential to reduce bandwidth and processing requirements by about x100 - it has been estimated that our brains would weigh ~60Kg if we were to process all our visual input at uniform high resolution. We have reported a foveated visual architecture [2,3,4] that implements a functional model of the retina-visual cortex to produce feature vectors that can be matched/classified using conventional methods, or indeed could be adapted to employ Deep Convolutional Neural Nets for the classification/interpretation stage. Given the above processing/bandwidth limitations, a viable way forward would be to perform off-line learning and implement the forward recognition path on the mobile platform, returning simple object labels, or sparse hierarchical feature symbols, and gaze control commands to the host robot vision system and controller. We are now at the early stages of investigating how best to port our foveated architecture onto an ARM-based smartphone platform. To achieve the required levels of performance we propose to port and optimise our retina model to the mobile ARM processor architecture in conjunction with their integrated GPUs. We will then be in the position to provide a foveated smart vision system on a smartphone with the advantage of processing speed gains and bandwidth optimisations. Our approach will be to develop efficient parallelising compilers and perhaps propose new processor architectural features to support this approach to computer vision, e.g. efficient processing of hexagonally sampled foveated images. Our current goal is to have a foveated system running in real-time on at least a 1080p input video stream to serve as a front-end robot sensor for tasks such as general purpose object recognition and reliable dense SLAM using a commercial off-the-shelf smartphone. Initially this system would communicate a symbol stream to conventional hardware performing back-end visual classification/interpretation, although simple object detection and recognition tasks should be possible on-board the device. We propose that, as in Nature, foveated vision is the key to achieving the necessary data reduction to be able to implement complete visual recognition and learning processes on the smartphone itself

Architecture Without Explicit Locks for Logic Simulation on SIMD Machines

The presentation describes an architecture for logic simulation that takes advantages of the features of multi-core SIMD architectures. It uses neither explicit locks nor queues, using instead oblivious simulation. Data structures are targeted to efficient SIMD and multi-core cache operation. We demonstrate high levels of parallelisation on Xeon Phi and AMD multi-core machines. Performance on a Xeon Phi is comparable to or better than on a 1000 core Blue Gene machine